Derandomization of Euclidean Random Walks
نویسندگان
چکیده
We consider the problem of derandomizing random walks in the Euclidean space R. We show that for k = 2, and in some cases in higher dimensions, such walks can be simulated in Logspace using only poly-logarithmically many truly random bits. As a corollary, we show that the random walk can be deterministically simulated in space O(logn √ log log n), where 1/n is the desired precision of the simulation.
منابع مشابه
Total Variation Discrepancy of Deterministic Random Walks for Ergodic Markov Chains
Motivated by a derandomization of Markov chain Monte Carlo (MCMC), this paper investigates deterministic random walks, which is a deterministic process analogous to a random walk. While there are several progresses on the analysis of the vertex-wise discrepancy (i.e., L∞ discrepancy), little is known about the total variation discrepancy (i.e., L1 discrepancy), which plays a significant role in...
متن کاملLecture 17: Space-bounded Derandomization
The randomized result was obtained by viewing random bit sequences as vertices of an expander graph and performing a random walk upon choosing a start vertex uniformly at random, and casting a majority vote. The error (probability of majority vote resulting in error) exponentially decreases with the length of the random walk. We also saw a stronger statement based on Chernoff bounds for random ...
متن کاملDesign of a Novel Network Architecture for Distributed Event-Based Systems Using Directional Random Walks in an Ubiquitous Sensing Scenario
Ubiquitous sensing devices frequently disseminate data among them. The use of a distributed event-based system that decouples publishers from subscribers arises as an ideal candidate to implement the dissemination process. In this paper, we present a network architecture that merges the network and overlay layers of typical structured event-based systems. Directional random walks are used for t...
متن کاملAn Introduction to Random Walks
In this paper, we investigate simple random walks in n-dimensional Euclidean Space. We begin by defining simple random walk; we give particular attention to the symmetric random walk on the d-dimensional integer lattice Zd. We proceed to consider returns to the origin, recurrence, the level-crossing phenomenon, and the Gambler’s Ruin.
متن کاملEuclidean Space of City Space Syntax
We demonstrate that random walks embed connected undirected graphs into Euclidean space, in which distances and angles acquire the clear statistical interpretation. Being defined on the spatial network of Venetian canals, random walks afford a portrait of the city space syntax and measure its intelligibility. In the present Letter, we investigate the spatial network of 96 canals in Venice (that...
متن کامل